Intersective sets and Diophantine approximation
نویسندگان
چکیده
منابع مشابه
A Quantitative Result on Diophantine Approximation for Intersective Polynomials
In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a consequence of this result for polynomial structures in sumsets and limitations of the method.
متن کاملDiophantine approximation and badly approximable sets
Let (X, d) be a metric space and (Ω, d) a compact subspace of X which supports a non-atomic finite measurem. We consider ‘natural’ classes of badly approximable subsets of Ω. Loosely speaking, these consist of points in Ω which ‘stay clear’ of some given set of points in X. The classical set Bad of ‘badly approximable’ numbers in the theory of Diophantine approximation falls within our framewor...
متن کاملWinning sets, quasiconformal maps and Diophantine approximation
This paper describes two new types of winning sets in R, defined using variants of Schmidt’s game. These strong and absolute winning sets include many Diophantine sets of measure zero and first category, and have good behavior under countable intersections. Most notably, they are invariant under quasiconformal maps, while classical winning sets are not.
متن کاملDiophantine approximation and Diophantine equations
The first course is devoted to the basic setup of Diophantine approximation: we start with rational approximation to a single real number. Firstly, positive results tell us that a real number x has “good” rational approximation p/q, where “good” is when one compares |x − p/q| and q. We discuss Dirichlet’s result in 1842 (see [6] Course N◦2 §2.1) and the Markoff–Lagrange spectrum ([6] Course N◦1...
متن کاملTest sets of the knapsack problem and simultaneous diophantine approximation
Absact This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 2004
ISSN: 0026-2285
DOI: 10.1307/mmj/1100623419